Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Path planning of mobile robots based on ion motion-artificial bee colony algorithm
WEI Bo, YANG Rong, SHU Sihao, WAN Yong, MIAO Jianguo
Journal of Computer Applications    2021, 41 (2): 379-383.   DOI: 10.11772/j.issn.1001-9081.2020060794
Abstract417)      PDF (950KB)(738)       Save
Aiming at the path planning of mobile robots in storage environment, a path planning method based on Ion Motion-Artificial Bee Colony (IM-ABC) algorithm was proposed. In order to improve the convergence speed and searching ability of the traditional Artificial Bee Colony (ABC) algorithm in path planning, a strategy of simulating ion motion was used to update the swarm in this method. Firstly, at the early stage of the algorithm, the anion-cation cross search in ion motion algorithm was used to update the leading bees and following bees, so as to guide the direction of population evolution and greatly improve the development ability of population. Secondly, at the late stage of the algorithm, in order to avoid the local optimum caused by premature convergence in the early stage, random search was adopted by the leading bees and reverse roulette was used by the following bees to select honey sources and expand population diversity. Finally, an adaptive floral fragrance concentration was proposed in the global update mechanism to improve the sampling method, and then the IM-ABC algorithm was obtained. Benchmark function test and simulation experiment results show that the IM-ABC algorithm can not only rapidly converge, but also reduce the number of iterations by 58.3% and improve the optimization performance by 12.6% compared to the traditional ABC algorithm, indicating the high planning efficiency of IM-ABC algorithm.
Reference | Related Articles | Metrics
Satellite scheduling method for intensive tasks based on improved fireworks algorithm
ZHANG Ming, WANG Jindong, WEI Bo
Journal of Computer Applications    2018, 38 (9): 2712-2719.   DOI: 10.11772/j.issn.1001-9081.2018030547
Abstract550)      PDF (1302KB)(308)       Save
Traditional satellite scheduling models are generally simple, when the problem is large and the tasks are concentrated, the disadvantages of mutual exclusion between tasks and low task revenue often occur. To solve this problem, an intensive task imaging satellite scheduling method based on Improved FireWorks Algorithm (IFWA) was proposed. On the basis of analyzing the characteristics of intensive task processing and imaging satellite observation, synthetic constraint analysis on the tasks was firstly carried out, and then a multi-satellite intensive task scheduling Constraint Satisfaction Problem (CSP) model based on task synthesis was established by comprehensively considering the constraints such as the observable time of the imaging satellite, the attitude adjustment time between tasks, the energy and capacity of the imaging satellite method. Finally, an improved fireworks algorithm was used to solve the model, elitist selection strategy was used to ensure the diversity of population and accelerate the convergence of the algorithm, thus a better satellite scheduling scheme was obtained. The simulation results show that the proposed model increases the average revenue by 30% to 35% and improves the time efficiency by 32% to 45% compared with the scheduling model without consideration of task synthesis factor, which validates its feasibility and effectiveness.
Reference | Related Articles | Metrics
Service trust evaluation method based on weighted multiple attribute cloud
WEI Bo WANG Jindong ZHANG Hengwei YU Dingkun
Journal of Computer Applications    2014, 34 (3): 678-682.   DOI: 10.11772/j.issn.1001-9081.2014.03.0678
Abstract476)      PDF (839KB)(395)       Save

With regard to the characteristics of randomness and fuzziness in service trust under computing environment, and lack of consideration in timeliness and recommend trust, a service trust evaluation method based on weighted multiple attribute cloud was proposed. Firstly, each service evaluation was given weight by introducing time decay factor, the evaluation granularity was refined by trust evaluation from multiple attribute of service, and direct trust cloud could be generated using the weighted attribute trust cloud backward generator. Then, the weight of recommender could be confirmed by similarity of evaluation, and recommended trust cloud was obtained by recommend information. Finally, the comprehensive trust cloud was obtained by merging direct and recommended trust cloud, and the trust rating could be confirmed by cloud similarity calculation. The simulation results show that the proposed method can improve the success rate of services interaction obviously, restrain malicious recommendation effectively, and reflect the situation of service trust under computing environment more truly.

Related Articles | Metrics
ISCP-TCAM:a high speed power-efficient routing table search engine architecture
YANG Kui-wu,WEI Bo,ZHANG Xiao-yi,LI Ou
Journal of Computer Applications    2005, 25 (04): 910-912.   DOI: 10.3724/SP.J.1087.2005.0910
Abstract1052)      PDF (131KB)(868)       Save

ropose the ISCP-TCAM (Improved Stage-Control Pipeline Ternary Content Addressable Memory),a high speed power-efficient routing table search architecture.This architecture not only has the merits of easy managing and updating of conventional Ternary Content Addressable Memory(TCAM),but also power-efficient compare with the TCAM with the same size.In order to evaluate it’s performance,we implement it with FPGA of ALTERA company.It is a good selection in the design of high speed power-efficient routing table search engine.

Related Articles | Metrics